The Minimum Eigenvalue of a Symmetric Positive De nite Toeplitz Matrix and Rational Hermitian Interpolation

نویسنده

  • Wolfgang Mackens
چکیده

A novel method for computing the minimal eigenvalue of a symmetric positive deenite Toeplitz matrix is presented. Similarly to the algorithm of Cybenko and Van Loan it is a combination of bisection and a root nding method. Both phases of the method are accelerated considerably by rational Hermite interpolation of the secular equation. For randomly generated test problems of dimension 800 the average number of linear systems which have to be solved to determine the smallest eigenvalue is 6.6 which reduces the computational cost of the method of Cybenko and Van Loan to approximately 35%. The method includes a rigorous error bound.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing the Smallest Eigenvalue of a Symmetric Toeplitz Matrix

In this note we discuss a method of order 1 + √ 3 for computing the smallest eigenvalue λ1 of a symmetric and positive definite Toeplitz matrix. It generalizes and improves a method introduced in [7] which is based on rational Hermitean interpolation of the secular equation. Taking advantage of a further rational approximation of the secular equation which is essentially for free and which yiel...

متن کامل

A Projection Method for Computing the Minimum Eigenvalue of a Symmetric Positive De nite Toeplitz Matrix

A projection method for computing the minimal eigenvalue of a symmetric and positive deenite Toeplitz matrix is presented. It generalizes and accelerates the algorithm considered in 12]. Global and cubic convergence is proved. Randomly generated test problems up to dimension 1024 demonstrate the methods good global behaviour.

متن کامل

A hybrid method for computing the smallest eigenvalue of a symmetric and positive definite Toeplitz matrix

In this paper we suggest a hybrid method for computing the smallest eigenvalue of a symmetric and positive definite Toeplitz matrix which takes advantage of two types of methods, Newton’s method for the characteristic polynomial and projection methods based on rational interpolation of the secular equation.

متن کامل

A Projection Method for Computing the MinimumEigenvalue of a Symmetric Positive De nite Toeplitz

A projection method for computing the minimal eigenvalue of a symmetric and positive deenite Toeplitz matrix is presented. It generalizes and accelerates the algorithm considered in 12]. Global and cubic convergence is proved. Randomly generated test problems up to dimension 1024 demonstrate the methods good global behaviour.

متن کامل

Preconditioned Lanczos Methods for the Minimum Eigenvalue of a Symmetric Positive Definite Toeplitz Matrix

In this paper, we apply the preconditioned Lanczos (PL) method to compute the minimum eigenvalue of a symmetric positive definite Toeplitz matrix. The sine transform-based preconditioner is used to speed up the convergence rate of the PL method. The resulting method involves only Toeplitz and sine transform matrix-vector multiplications and hence can be computed efficiently by fast transform al...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997